A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings

Extending Lipschitz maps for graph embedding via PageRank

From nonlinear embedding to graph distances : a spectral perspective

Spectral Graph-Based Method of Multimodal Word Embedding

In this paper, we propose a novel method for multimodal word embedding, which exploit a generalized framework of multiview spectral graph embedding to take into account visual appearances or scenes denoted by words in a corpus. We evaluated our method through word similarity tasks and a concept-to-image search task, having found that it provides word representations that reflect visual informat...

Projective Unsupervised Flexible Embedding with Optimal Graph

Graph based dimensionality reduction techniques have been successfully applied to clustering and classification tasks. The fundamental basis of these algorithms is the constructed graph which dominates their performance. Usually, the graph is defined by the input affinity matrix. However, the affinity matrix is sub-optimal for dimension reduction as there is much noise in the data. To address t...

Knowledge Graph Embedding by Flexible Translation

Knowledge graph embedding refers to projecting entities and relations in knowledge graph into continuous vector spaces. State-of-the-art methods, such as TransE, TransH, and TransR build embeddings by treating relation as translation from head entity to tail entity. However, previous models can not deal with reflexive/one-to-many/manyto-one/many-to-many relations properly, or lack of scalabilit...